Two-Layer Location-Routing Problem Based on Heuristic Hybrid Algorithm

نویسندگان

چکیده

Location-routing problem (LRP) thoroughly considers location allocation (LAP) and vehicle routing (VRP) which has been an integral part applied in modern logistics. A number of researchers at home aboard have put forward their views by establishing fine models. On the basis studying previous research results classification, summary, comparative analysis, this study hence proposes a new solution-fuzzy clustering model algorithm to resolve two-layer location-routing based on heuristic hybrid algorithm: Designing genetic simulated annealing (GASA) optimize initial value fuzzy C-means (FCM); considering roving visit characteristics vehicles design path employing special VRP problem—the multiple traveling salesman (MTSP). Theoretical analysis experimental show that used advantages fast convergence speed less iterations, significantly improve quality solution FCM LAP, shorten patrol cycle great extent, utilization, save costs. specific example is programmed MATLAB verify feasibility method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy ‎Demands‎

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...

متن کامل

Research on Two-layer Location-Routing Problem and Optimization Algorithm

Location-routing problem (LRP) is a combinational optimization problem in a logistics system. Most heuristic methods employed for LRP divide the problem into location assignment and vehicle routing with a two-phase method, but this method often does not lead to a satisfactory result for the information can not be compressed from one phase to the other efficiently. In this paper we are concerned...

متن کامل

a hybrid heuristic algorithm to solve capacitated location-routing problem with fuzzy ‎demands‎

in this paper, the capacitated location-routing problem with fuzzy demands (clrp-fd) is considered. the clrp-fd is composed of two well-known problems: facility location problem and vehicle routing problem. the problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. in clrp-fd, a set of c...

متن کامل

A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (...

متن کامل

A Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm

The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2023

ISSN: ['1026-7077', '1563-5147', '1024-123X']

DOI: https://doi.org/10.1155/2023/7335443